An Efficient Encryption Scheme for Small Arbitrary Length Domains
نویسندگان
چکیده
منابع مشابه
An Efficient Symmetric Searchable Encryption Scheme for Cloud Storage
Symmetric searchable encryption for cloud storage enables users to retrieve the documents they want in a privacy-preserving way, which has become a hotspot of research. In this paper, we propose an efficient keyword search scheme over encrypted cloud data. We firstly adopt a structure named as inverted matrix (IM) to build search index. The IM is consisted of index vectors, each of which is ass...
متن کاملSponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length Message
OAEP and other similar schemes proven secure in Random-Oracle Model require one or more hash functions with output size larger than those of standard hash functions. In this paper, we show that by utilizing popular Sponge constructions in OAEP framework, we can eliminate the need of such hash functions. We provide a new scheme in OAEP framework based on Sponge construction and call our scheme S...
متن کاملCompact CCA-Secure Encryption for Messages of Arbitrary Length
This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ciphertext overhead (i.e., the difference between ciphertext and plaintext) is one group element only. Such a property is particularly useful when encrypting short messages such as a PIN or a credit card number in bandw...
متن کاملSmall submodules with respect to an arbitrary submodule
Let $R$ be an arbitrary ring and $T$ be a submodule of an $R$-module $M$. A submodule $N$ of $M$ is called $T$-small in $M$ provided for each submodule $X$ of $M$, $Tsubseteq X+N$ implies that $Tsubseteq X$. We study this mentioned notion which is a generalization of the small submodules and we obtain some related results.
متن کاملAn Efficient and Provable Secure Revocable Identity-Based Encryption Scheme
Revocation functionality is necessary and crucial to identity-based cryptosystems. Revocable identity-based encryption (RIBE) has attracted a lot of attention in recent years, many RIBE schemes have been proposed in the literature but shown to be either insecure or inefficient. In this paper, we propose a new scalable RIBE scheme with decryption key exposure resilience by combining Lewko and Wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2018
ISSN: 2321-9653
DOI: 10.22214/ijraset.2018.1397